Synthesis of Gray codes
نویسندگان
چکیده
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملAntipodal Gray codes
An n-bit Gray code is a circular listing of the 2 n-bit strings so that successive strings differ only in one bit position. An n-bit antipodal Gray code has the additional property that the complement of any string appears exactly n steps away in the list. The problem of determining for which values of n antipodal Gray codes can exist was posed by Hunter Snevily, who showed them to be possible ...
متن کاملTransition Restricted Gray Codes
A Gray code is a Hamilton path H on the n-cube, Q n. By labeling each edge of Q n with the dimension that changes between its incident vertices, a Gray code can be thought of as a sequence H = t 1 ; t 2 ; : : : ; t N-1 (with N = 2 n and each t i satisfying 1 t i n). The sequence H deenes an (undirected) graph of transitions, G H , whose vertex set is f1; 2; : : : ; ng and whose edge set E(G H) ...
متن کاملBalanced Gray Codes
It is shown that balanced n-bit Gray codes can be constructed for all positive integers n. A balanced Gray code is one in which the bit changes are distributed as equally as possible among the bit positions. The strategy used is to prove the existence of a certain subsequence which will allow successful use of the construction proposed by Robinson and Cohn in 1981. Although Wagner and West prov...
متن کاملGray Codes from Antimatroids
We show three main results concerning Hamiltonicity of graphs derived from antimatroids. These results provide Gray codes for the feasible sets and basic words of antimatroids. For antimatroid (E; F), let J (F) denote the graph whose vertices are the sets of F, where two vertices are adjacent if the corresponding sets diier by one element. Deene J (F; k) to be the subgraph of J (F) 2 induced by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Aviation University
سال: 2002
ISSN: 2306-1472,1813-1166
DOI: 10.18372/2306-1472.12.13557